Metric-Constrained Optimization for Graph Clustering Algorithms
نویسندگان
چکیده
منابع مشابه
Density-Constrained Graph Clustering
Clusterings of graphs are often constructed and evaluated with the aid of a quality measure. Numerous such measures exist, some of which adapt an established measure for graph cuts to clusterings. In this work we pursue the problem of finding clusterings which simultaneously feature guaranteed intraand good intercluster quality. To this end we systematically assemble a range of cut-based bicrit...
متن کاملRepeated Record Ordering for Constrained Size Clustering
One of the main techniques used in data mining is data clustering, which has many applications in computer science, biology, and social sciences. Constrained clustering is a type of clustering in which side information provided by the user is incorporated into current clustering algorithms. One of the well researched constrained clustering algorithms is called microaggregation. In a microaggreg...
متن کاملAlgorithms for PDE-Constrained Optimization
In this paper we review a number of algorithmic approaches for solving optimization problems with PDE constraints. Most of these methods were originally developed for finite dimensional problems. When applied to optimization problems with PDE constraints, new aspects become important. For instance, (discretized) PDE-constrained problems are inherently large-scale. Some aspects, like mesh indepe...
متن کاملThe Shape Metric for Clustering Algorithms
We construct a method by which we can calculate the precision with which an algorithm identifies the shape of a cluster. We present our results for several well known clustering algorithms and suggest ways to improve performance for newer algorithms.
متن کاملConstrained Spectral Clustering with Distance Metric Learning
Spectral clustering is a flexible clustering technique that finds data clusters in the spectral embedding space of the data. It doesn’t assume convexity of the shape of clusters, and is able to find non-linear cluster boundaries. Constrained spectral clustering aims at incorporating user-defined pairwise constraints in to spectral clustering. Typically, there are two kinds of pairwise constrain...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: SIAM Journal on Mathematics of Data Science
سال: 2019
ISSN: 2577-0187
DOI: 10.1137/18m1217152